Inequalities for Plane Partitions
نویسندگان
چکیده
Abstract Inequalities are important features in the context of sequences numbers and polynomials. The Bessenrodt–Ono inequality for partition Nekrasov–Okounkov polynomials has only recently been discovered. In this paper we study log-concavity (Turán inequality) plane partitions their polynomization.
منابع مشابه
Plane Partitions
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find generating functions. In particular, we consider bounded plane partitions, symmetric plane partitions and weak reverse plane partitions. Using the combinatorial interpretations of Schur functions in relation to semistandard Young tableaux, we rely on the properties of symmetric functions. In our ...
متن کاملSymmetries of plane partitions
We introduce a new symmetry operation, called complementation, on plane partitions whose three-dimensional diagram is contained in a given box. This operation was suggested by work of Mills, Robbins, and Rumsey. There then arise a total of ten inequivalent problems concerned with the enumeration of plane partitions with a given symmetry. Four of these ten problems had been previously considered...
متن کاملSubwords and Plane Partitions
Using the powerful machinery available for reduced words of type B, we demonstrate a bijection between centrally symmetric k-triangulations of a 2(n + k)-gon and plane partitions of height at most k in a square of size n. This bijection can be viewed as the type B analogue of a bijection for k-triangulations due to L. Serrano and C. Stump. Résumé. En utilisant la machinerie puissante pour mots ...
متن کاملShuffling algorithm for boxed plane partitions
We introduce discrete time Markov chains that preserve uniform measures on boxed plane partitions. Elementary Markov steps change the size of the box from a × b × c to (a − 1)× (b + 1)× c or (a + 1)× (b − 1)× c. Algorithmic realization of each step involves O((a+ b)c) operations. One application is an efficient perfect random sampling algorithm for uniformly distributed boxed plane partitions. ...
متن کاملGenerating functions for shifted plane partitions
With the help of a tableaux method, determinant formulas for trace generating functions for various classes of shifted plane partitions are derived. Proceeding from these determinants, generalizations of Gansner's (J. hook formulas for shifted plane partitions and alternative proofs of recent results of Proctor about alternating trace generating functions are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2022
ISSN: ['0219-3094', '0218-0006']
DOI: https://doi.org/10.1007/s00026-022-00604-4